Numerically stable fast convergence least-squares algorithms for multichannel active sound cancellation systems and sound deconvolution systems

نویسنده

  • Martin Bouchard
چکیده

In recent years, recursive least-squares (RLS) algorithms and fast-transversal-.lters (FTF) algorithms have been introduced for multichannel active sound cancellation (ASC) systems and multichannel sound deconvolution (MSD) systems. It was reported that these algorithms can greatly improve the convergence speed of the ASC=MSD systems using adaptive FIR .lters. However, numerical instability of the algorithms is an issue that needs to be resolved. In this paper, extensions of numerically stable realisations of RLS algorithms such as the inverse QR-RLS, the QR decomposition least-squares-lattice (QRD-LSL) and the symmetry preserving RLS algorithms are introduced for the speci.c problem of multichannel ASC=MSD. Multichannel versions of some of these algorithms have previously been published for prediction or identi.cation systems, but not for control systems. The case of underdetermined ASC=MSD systems (i.e. systems with more actuators than error sensors) is also considered, to show that in these cases it may be required to use constrained algorithms in order to have numerical stability. Constrained algorithms for multichannel ASC=MSD systems are therefore introduced for two types of constraints: minimisation of the actuator signals power and minimization of the adaptive .lters square coe9cients. Simulation results are shown to verify the numerical stability of the algorithms introduced in the paper. ? 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multichannel recursive-least-square algorithms and fast-transversal-filter algorithms for active noise control and sound reproduction systems

In the last ten years, there has been much research on active noise control (ANC) systems and transaural sound reproduction (TSR) systems. In those fields, multichannel FIR adaptive filters are extensively used. For the learning of FIR adaptive filters, recursive-least-squares (RLS) algorithms are known to produce a faster convergence speed than stochastic gradient descent techniques, such as t...

متن کامل

Faster Convergence and Improved Performance in Least-Squares Training of Neural Networks for Active Sound Cancellation

This paper introduces new recursive least-squares algorithms with faster convergence and improved steady-state performance for the training of multilayer feedforward neural networks, used in a two neural networks structure for multichannel nonlinear active sound cancellation. Non-linearity in active sound cancellation systems is mostly found in actuators. The paper introduces the main concepts ...

متن کامل

The Gauss–Seidel fast affine projection algorithm for multichannel active noise control and sound reproduction systems

In the field of adaptive filtering, the fast implementations of affine projection algorithms are known to provide a good tradeoff between convergence speed and computational complexity. Such algorithms have recently been published for multichannel active noise control systems. Previous work reported that these algorithms can outperform more complex recursive least-squares algorithms when noisy ...

متن کامل

Recursive least-squares algorithms with good numerical stability for multichannel active noise control

Some recursive least-squares algorithms for multichannel active noise control have recently been introduced, including computationally efficient (i.e. “fast”) versions. However, these previously published algorithms suffer from numerical instability due to finite precision computations. In this paper, numerically robust recursive least-squares algorithms for multichannel active noise control sy...

متن کامل

Multichannel affine and fast affine projection algorithms for active noise control and acoustic equalization systems

In the field of adaptive signal processing, it is well known that affine projection algorithms or their low-computational implementations fast affine projection algorithms can produce a good tradeoff between convergence speed and computational complexity. Although these algorithms typically do not provide the same convergence speed as recursive-least-squares algorithms, they can provide a much ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Signal Processing

دوره 82  شماره 

صفحات  -

تاریخ انتشار 2002